An Algorithm for Analyzing the Transitive Behavior of Reversible One-Dimensional Cellular Automata with Both Welch Indices Different
نویسندگان
چکیده
An algorithm is presented for analyzing the transitive behavior of reversible one-dimensional cellular automata, where reversibility refers to injective cellular automata which have a bijective behavior for spatially periodic configurations. In particular we study reversible automata where the ancestors of finite sequences differ at both ends (technically, with both Welch indices different from 1). The algorithm uses the combinatorial properties of reversible automata and their characterization by block permutations. A matrix presentation of the dynamical behavior and examples are presented.
منابع مشابه
Transitive behavior in reversible one-dimensional cellular automata with a Welch index 1
The problem of knowing and characterizing the transitive behavior of a given cellular automaton is a very interesting topic. This paper provides a matrix representation of the global dynamics in reversible one-dimensional cellular automata with a Welch index 1, i.e. those where the ancestors differ just at one end. We prove that the transitive closure of this matrix shows diverse types of trans...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملNovel Defect Terminolgy Beside Evaluation And Design Fault Tolerant Logic Gates In Quantum-Dot Cellular Automata
Quantum dot Cellular Automata (QCA) is one of the important nano-level technologies for implementation of both combinational and sequential systems. QCA have the potential to achieve low power dissipation and operate high speed at THZ frequencies. However large probability of occurrence fabrication defects in QCA, is a fundamental challenge to use this emerging technology. Because of these vari...
متن کاملA CELLULAR AUTOMATA BASED FIREFLY ALGORITHM FOR LAYOUT OPTIMIZAION OF TRUSS STRUCTURES
In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJUC
دوره 1 شماره
صفحات -
تاریخ انتشار 2005